Providing Better Support for Quanti

نویسندگان

  • Sudhir G. Rao
  • Antonio Badia
  • Dirk Van Gucht
چکیده

Relational database systems do not eeectively support complex queries containing quantiiers (quantiied queries) that are increasingly becoming important in decision support applications. Generalized quantiiers provide an eeective way of expressing such queries naturally. In this paper, we consider the problem of processing quantiied queries within the generalized quantiier framework. We demonstrate that current relational systems are ill-equipped, both at the language and at the query processing level, to deal with such queries. We also provide insights into the intrinsic diicul-ties associated with processing such queries. We then describe the implementation of a quantiied query processor, Q 2 P, that is based on multidimensional and boolean matrix structures. We provide results of performance experiments run on Q 2 P that demonstrate superior performance on quantiied queries. Our results indicate that it is feasible to augment relational systems with query subsystems like Q 2 P for signiicant performance beneets for quantiied queries in decision support applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Providing Better Support for Quanti ed Queries

Relational database systems do not e ectively support complex queries containing quanti ers (quanti ed queries) that are increasingly becoming important in decision support applications. Generalized quanti ers provide an e ective way of expressing such queries naturally. In this paper, we consider the problem of processing quanti ed queries within the generalized quanti er framework. We demonst...

متن کامل

Semantics of Constraint Logic Programs with Bounded Quantifiers

We survey the areas of Constraint programming, Bounded Quanti ers and Collection Types, then we describe an extension of constraint logic programming by bounded quanti ers. Bounded quanti ers provide the support for nite domain constraint programming in a natural way. We de ne several semantics for constraint logic programs with bounded quanti ers and prove their equivalence. Our results can be...

متن کامل

Naive Truth and Restricted Quantification: Saving Truth a whole lot Better

Restricted quanti cation poses a serious and under-appreciated challenge for non-classical approaches to both vagueness and the semantic paradoxes. It is tempting to explain All A are B as For all x, if x is A then x is B ; but in the non-classical logics typically used in dealing with vagueness and the semantic paradoxes (even those where 'if ... then' is a special conditional not de nable in ...

متن کامل

مطالعه حمایت اجتماعی ادارک شده در کارکنان یکی از کارخانه‌های تولیدی شهر ارومیه در سال 1393

Background & objective: Perceived social support in the personnel of any organization is an important psychological factor that affects the efficiency of the workforce and exerts direct and positive effects on the their quality of life. The present study was conducted to investgiate the level of perceived social support in the personnel of a manufacturing industry in Urmia and to determine its ...

متن کامل

Extending Gg Odel for Expressing Restricted Quantiications and Arrays

The expressiveness of the declarative language G odel can be improved by adding to it bounded quanti cations, i.e., quanti cations over nite domains, and arrays. Many problems can be expressed more concisely using bounded quanti cations than using recursion. Arrays are natural for many applications, e.g., in scienti c computing, and are conveniently used in bounded quanti cations. Treating bou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007